Discrete models and algorithms for packet scheduling in smart antennas
نویسندگان
چکیده
منابع مشابه
Fading-Aware Packet Scheduling Algorithm in OFDM-MIMO Systems
To maximize system throughput and guarantee the quality of service (QoS) of multimedia traffic in orthogonal frequency division multiplexing (OFDM) systems with smart antennas, a new packet scheduler is introduced to consider QoS requirements, packet location in the frame, and modulation level. In the frequency domain, several consecutive subchannels are grouped as a frequency subband. Each sub...
متن کاملTowards 4G IP-based Wireless Systems
A packet switched wireless cellular system with wide area coverage and high throughput is proposed. It is designed to be cost effective and to provide high spectral efficiency. The high performance is achieved by the use of long term channel predictions, in both time and frequency, scheduling among users, and smart antennas combined with adaptive modulation and power control. Calculations based...
متن کاملA 4G IP-based Wireless System Proposal
A packet switched wireless cellular system with wide area coverage and high throughput is proposed. It is designed to be cost effective and to provide high spectral efficiency. The high performance is achieved by the use of long term channel predictions, in both time and frequency, scheduling among users, and smart antennas combined with adaptive modulation and power control. Calculations based...
متن کاملSmart Antennas in Wireless Networks : Systems Issues and Performance Limits
This work deals with performance limits when using smart antennas in future wireless systems. The current evolution in the field of wireless communication implicates a substantially increased demand on transport capacity. Smart antennas is one very powerful means to fulfill these demands. In this work the use of smart antennas, deployed at either the access point or both the access point and th...
متن کاملInteger Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
We call a matrix A nearly totally unimodular if it can be obtained from a totally unimodular matrix à by adding to each row of à an integer multiple of some fixed row a of Ã. For an integer vector b and a nearly totally unimodular matrix A, we denote by PA,b the integer hull of the set {x ∈ R | Ax ≤ b}. We show that PA,b has the integer decomposition property and that we can find a decompositio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 13 شماره
صفحات -
تاریخ انتشار 2003